Tabular Parsing
نویسندگان
چکیده
Parsing is the process of determining the parses of an input string according to a grammar. In this chapter we will restrict ourselves to context-free grammars. Parsing is related to recognition, which is the process of determining whether an input string is in the language described by a grammar or automaton. Most algorithms we will discuss are recognition algorithms, but since they can be straightforwardly extended to perform parsing, we will not make a sharp distinction here between parsing and recognition algorithms.
منابع مشابه
Implementing Tabular Deduction for Multimodal Logical Grammar
The paper proposes a method for tabular deduction for multimodal logical grammar, extending a method for linear logic presented in (Hepple, 1996; Hepple, 1998). Tabular deduction for multimodal logical grammar avoids redundant computation like chart parsing does for CFGs. The method discussed here enables one to process any kind of multimodal logical grammar fragment. An implementation of the m...
متن کاملAn Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very diierent areas of parsing theory, and which include deterministic algorithms , tabular algorithms, and a parallel algorithm. We show that these algorithms are based on the same underlying ideas. By relating existing ideas, we hope to provide an opportunity to improve some algorithms based on features of oth...
متن کاملEfficient Tabular LR Parsing
We give a new treatment of tabular LR parsing, which is an alternative to Tomita’s generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive because it uses simpler concepts, such as grammar transformations and standard tabulation techniques also know as chart parsing. Secondly, the static and dynamic complexity of parsing, both in space and time...
متن کاملA tabular interpretation of bottom-up automata for TAG
We present a tabular interpretation for a class of 2–Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottomup automata models for this kind of languages.
متن کاملTabular Algorithms for TAG Parsing
We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.
متن کاملA Tabular Interpretation of Bottom - up Automata for TAGEric
We present a tabular interpretation for a class of 2{Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottom-up automata models for this kind of languages.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CL/0404009 شماره
صفحات -
تاریخ انتشار 2004